779. K-th Symbol in Grammar - LeetCode Solution


Recursion

Python Code:

class Solution:
    def kthGrammar(self, N: int, K: int) -> int:
        def solve(n, k):
            
            if n==1 and k==1:
                return False
            
            mid = (2**(n-1))//2
            
            if k <= mid:
                return solve(n-1, k)
            else:
                return not solve(n-1, k-mid)
            
        
        if solve(N, K):
            return 1
        else:
            return 0


Comments

Submit
0 Comments
More Questions

1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II